منابع مشابه
Systolic Tree !-Languages
The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.
متن کاملLocal Weighted Tree Languages
Local weighted tree languages over semirings are introduced. For an arbitrary semiring, a weighted tree language is shown to be recognizable iff it appears as the image of a local weighted tree language under a deterministic relabeling.
متن کاملResidual Tree Languages
By the Myhill-Nerode Theorem, a tree language L is recognisable if and only if ≡L has finite index. The minimal bottom-up DFTA of L is then defined using the congruence classes of ≡L as states. Exercise 1 (Bottom-up Residuals). Let L ⊆ T (F) and t ∈ T (F). The bottom-up residual of L by t is the set of all contexts C such that C[t] ∈ L: t−1L def = {C ∈ C(F) | C[t] ∈ L} . 1. Show that L is recog...
متن کاملTree algebras and varieties of tree languages
We consider several aspects of Wilke’s [T. Wilke, An algebraic characterization of frontier testable tree languages, Theoret. Comput. Sci. 154 (1996) 85–106] tree algebra formalism for representing binary labelled trees and compare it with approaches that represent trees as terms in the traditional way. A convergent term rewriting system yields normal form representations of binary trees and co...
متن کاملTree algebra of sofic tree languages
We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of subshifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of finite type. Each class corresponds to a cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.103.7